Normalized Averaging Using Adaptive Applicability Functions with Applications in Image Reconstruction from Sparsely and Randomly Sampled Data
نویسندگان
چکیده
In this paper we describe a new strategy for using local structure adaptive filtering in normalized convolution. The shape of the filter, used as the applicability function in the context of normalized convolution, adapts to the local image structure and avoids filtering across borders. The size of the filter is also adaptable to the local sampling density to avoid unnecessary smoothing over high certainty regions. We compare our adaptive interpolation technique with the conventional normalized averaging methods. We found that our strategy yields a result that is much closer to the original signal both visually and in terms of MSE, meanwhile retaining sharpness and improving the SNR.
منابع مشابه
Normalized averaging using adaptive applicability functions with application in image reconstruction from sparsely and randomly sampled data
In this paper we describe a new strategy for using local structure adaptive filtering in normalized convolution. The shape of the filter, used as the applicability function in the context of normalized convolution, adapts to the local image structure and avoids filtering across borders. The size of the filter is also adaptable to the local sampling density to avoid unnecessary smoothing over hi...
متن کاملRobust Fusion of Irregularly Sampled Data Using Adaptive Normalized Convolution
We present a novel algorithm for image fusion from irregularly sampled data. The method is based on the framework of normalized convolution (NC), in which the local signal is approximated through a projection onto a subspace. The use of polynomial basis functions in this paper makes NC equivalent to a local Taylor series expansion. Unlike the traditional framework, however, the window function ...
متن کاملImage Reconstruction by Prioritized Incremental Normalized Convolution
A priority-based method for pixel reconstruction and incremental hole filling in incomplete images and 3D surface data is presented. The method is primarily intended for reconstruction of occluded areas in 3D surfaces and makes use of a novel prioritizing scheme, based on a pixelwise defined confidence measure, that determines the order in which pixels are iteratively reconstructed. The actual ...
متن کاملFast magnetic resonance imaging simulation with sparsely encoded wavelet domain data in a compressive sensing framework
Randomly encoded compressive sensing (CS) has potential in fast acquisition of magnetic resonance imaging (MRI) data in most naturally compressible images. However, there is no guaranteed good performance for general applications by any of the traditional CS-MRI theoretical schemes developed so far. On the other hand, recent research demonstrates that adaptive sampling exploiting the tree struc...
متن کاملCompressed Sensing, ASBSR-method of image sampling and reconstruction and the problem of digital image acquisition with lowest possible sampling rate
The problem of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy is addressed. Basics of the sampling theory are outlined to show that the lower bound of signal sampling rate sufficient for signal reconstruction with a given accuracy is equal to the spectrum sparsity of the signal sparse approximation that has this accuracy....
متن کامل